Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
نویسندگان
چکیده
منابع مشابه
Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable to any symmetric positive definite matrix. The new preconditioner is breakdownfree and, when used in conjunction with the conjugate gradient method, results in a reliable solver for highly ill-conditioned linear systems. We also investigate an alternative approach to a stable approximate inverse...
متن کاملA Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix A is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient calculations. It is proved that in exact arithmetic the preconditioner is well defined if A is an H-matrix. The results of numerical experiments are pre...
متن کاملApproximate Inverse Preconditioningfor the Conjugate Gradient
1. Introduction. In this note we consider the solution of large, sparse linear systems of
متن کاملAlgorithm PREQN Fortran Subroutines for Preconditioning the Conjugate Gradient Method
PREQN is a package of Fortran subroutines for automatically generating pre conditioners for the conjugate gradient method It is designed for solving a sequence of linear systems Aix bi i t where the coe cient matrices Ai are symmetric and positive de nite and vary slowly Problems of this type arise for example in non linear optimization The preconditioners are based on limited memory quasi Newt...
متن کاملAlgorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method
We propose a method for preconditioner construction and parallel implementations of the Preconditioned Conjugate Gradient algorithm on GPU platforms. The preconditioning matrix is an approximate inverse derived from an algorithm for the iterative improvement of a solution to linear equations. Using a sparse matrix-vector product, our preconditioner is well suited for massively parallel GPU arch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2000
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827599356900